Isotonic Classification Trees
نویسندگان
چکیده
We propose a new algorithm for learning isotonic classification trees. It relabels non-monotone leaf nodes by performing the isotonic regression on the collection of leaf nodes. In case two leaf nodes with a common parent have the same class after relabeling, the tree is pruned in the parent node. Since we consider problems with ordered class labels, all results are evaluated on the basis of L1 prediction error. We experimentally compare the performance of the new algorithm with standard classification trees.
منابع مشابه
An Empirical Comparison of Supervised Learning Algorithms Using Different Performance Metrics
We present results from a large-scale empirical comparison between ten learning methods: SVMs, neural nets, logistic regression, naive bayes, memory-based learning, random forests, decision trees, bagged trees, boosted trees, and boosted stumps. We evaluate the methods on binary classification problems using nine performance criteria: accuracy, squared error, cross-entropy, ROC Area, F-score, p...
متن کاملAlgorithms for L∞ Isotonic Regression
This paper gives algorithms for determining L∞ weighted isotonic regressions satisfying order constraints given by a DAG with n vertices and m edges. Throughout, topological sorting plays an important role. A modification to an algorithm of Kaufman and Tamir gives an algorithm taking Θ(m log n) time for the general case, improving upon theirs when the graph is sparse. When the regression values...
متن کاملPredicting The Type of Malaria Using Classification and Regression Decision Trees
Predicting The Type of Malaria Using Classification and Regression Decision Trees Maryam Ashoori1 *, Fatemeh Hamzavi2 1School of Technical and Engineering, Higher Educational Complex of Saravan, Saravan, Iran 2School of Agriculture, Higher Educational Complex of Saravan, Saravan, Iran Abstract Background: Malaria is an infectious disease infecting 200 - 300 million people annually. Environme...
متن کاملProbability Calibration Trees
Obtaining accurate and well calibrated probability estimates from classifiers is useful in many applications, for example, when minimising the expected cost of classifications. Existing methods of calibrating probability estimates are applied globally, ignoring the potential for improvements by applying a more fine-grained model. We propose probability calibration trees, a modification of logis...
متن کاملApplication of classification trees-J48 to model the presence of roach (Rutilus rutilus) in rivers
In the present study, classification trees (CTs-J48 algorithm) were used to study the occurrence of roach in rivers in Flanders (Belgium). The presence/absence of roach was modelled based on a set of river characteristics. The predictive performance of the CTs models was assessed based on the percentage of Correctly Classified Instances (CCI) and Cohen's kappa statistics. To find the best model...
متن کامل